Algorithmic Simplicity and Relevance
نویسنده
چکیده
The human mind is known to be sensitive to complexity. For instance, the visual system reconstructs hidden parts of objects following a principle of maximum simplicity. We suggest here that higher cognitive processes, such as the selection of relevant situations, are sensitive to variations of complexity. Situations are relevant to human beings when they appear simpler to describe than to generate. This definition offers a predictive (i.e. falsifiable) model for the selection of situations worth reporting (interestingness) and for what individuals consider an appropriate move in conversation.
منابع مشابه
The Unpredictable Deviousness of Models
Computation models are central to algorithmic research. A model, designed to capture the essential features of a technology dispensing with irrelevant and burdensome details, is a judicious compromise between simplicity and fidelity (or reflectivity). This approach has unleashed an enormous amount of valuable algorithmic research over the years. However, the pursuit of simplicity may filter out...
متن کاملReality as simplicity
We discuss some fundamental aspects of information theory and its relationship to physics and neuroscience. The aim is to identify some questions and point out the relevance of the concept of Kolmogovov complexity in their eventual resolution. The discussion is based on two premises: 1) all human experience is generated in the brain, 2) all the brain has access to is information. Taken together...
متن کاملTuring is among us
Turing's BLOCKIN BLOCKIN present-‐day BLOCKIN BLOCKIN and BLOCKIN BLOCKIN all-‐time BLOCKIN BLOCKIN relevance BLOCKIN BLOCKIN arises BLOCKIN BLOCKIN from BLOCKIN BLOCKIN the BLOCKIN BLOCKIN timelessness BLOCKIN BLOCKIN of BLOCKIN BLOCKIN the issues he tackled, and the innovative light he shed upon them. Turing first defined the algorithmic limits of computability, when determined via effectiv...
متن کاملProbabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملSimplicity via provability for universal prefix-free Turing machines
Universality is one of the most important ideas in computability theory. There are various criteria of simplicity for universal Turing machines. Probably the most popular one is to count the number of states/symbols. This criterion is more complex than it may appear at a first glance. In this note we review recent results in Algorithmic Information Theory and propose three new criteria of simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011